翻訳と辞書 Words near each other ・ Carpenter's chameleon ・ Carpenter's chimaera ・ Carpenter's Coffee House ・ Carpenter's flasher wrasse ・ Carpenter's Flats Bridge ・ Carpenter's Fort, Ohio ・ Carpenter's Gothic ・ Carpenter's Home Church ・ Carpenter's Island, Pennsylvania ・ Carpenter's Landing, New Jersey ・ Carpenter's mate ・ Carpenter's Mill, Ohio ・ Carpenter's Point, New York ・ Carpenter's Road Lock ・ Carpenter's Rock House ・ Carpenter's rule problem ・ Carpenter's shed on Gardiners Island ・ Carpenter's Station ・ Carpenter's Station, Alabama ・ Carpenter's Station, Kentucky ・ Carpenter's Station, Tennessee ・ Carpenter, Bernalillo County, New Mexico ・ Carpenter, California ・ Carpenter, Colorado ・ Carpenter, Delaware ・ Carpenter, Grant County, New Mexico ・ Carpenter, Iowa ・ Carpenter, Kentucky ・ Carpenter, Lakeside, and Springvale Cemeteries ・ Carpenter, Mississippi Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Carpenter's rule problem ： ウィキペディア英語版 Carpenter's rule problem The carpenter's rule problem is a discrete geometry problem, which can be stated in the following manner: ''Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and simplicity are preserved along the way?'' A closely related problem is to show that any polygon can be ''convexified'', that is, continuously transformed, preserving edge distances and avoiding crossings, into a convex polygon. Both problems were successfully solved by . ==Combinatorial proof== Subsequently to their work, Ileana Streinu provided a simplified combinatorial proof formulated in the terminology of robot arm motion planning. Both the original proof and Streinu's proof work by finding non-expansive motions of the input, continuous transformations such that no two points ever move towards each other. Streinu's version of the proof adds edges to the input to form a pointed pseudotriangulation, removes one added convex hull edge from this graph, and shows that the remaining graph has a one-parameter family of motions in which all distances are nondecreasing. By repeatedly applying such motions, one eventually reaches a state in which no further expansive motions are possible, which can only happen when the input has been straightened or convexified. provide an application of this result to the mathematics of paper folding: they describe how to fold any single-vertex origami shape using only simple non-self-intersecting motions of the paper. Essentially, this folding process is a time-reversed version of the problem of convexifying a polygon of length smaller than π, but on the surface of a sphere rather than in the Euclidean plane. This result was extended by for spherical polygons of edge length smaller than 2π. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Carpenter's rule problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.